Automated support specification for efficient mining of interesting association rules

نویسندگان

  • Wen-Yang Lin
  • Ming-Cheng Tseng
چکیده

In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules mining is the setting of support constraint. A high-support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of seeking the way for setting the appropriate support constraint, all current approaches leave the users to be in charge of the support setting, which, however, puts the users in a dilemma. This paper is an effort to answer this long-standing open question. According to the notion of confidence and lift measures, we propose an automatic support specification for efficiently mining high-confidence and positive lift associations without consulting the users. Experimental results show that the proposed method not only is good at discovering high-confidence and positive lift associations, but also is effective in reducing the spurious frequent itemsets. W.Y. LIN AND M.C. TSENG 2 Journal of Information Science © CILIP 2005

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated Support Specification for Efficient Mining of Interesting Association Rules Automated Support Specification for Efficient Mining of Interesting Association Rules

In recent years, the weakness of the canonical support-confidence framework for associations mining has been widely studied. One of the difficulties in applying association rules mining is the setting of support constraints. A high-support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of...

متن کامل

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

An Efficient Algorithm to Automated Discovery of Interesting Positive and Negative Association Rules

Association Rule mining is very efficient technique for finding strong relation between correlated data. The correlation of data gives meaning full extraction process. For the discovering frequent items and the mining of positive rules, a variety of algorithms are used such as Apriori algorithm and tree based algorithm. But these algorithms do not consider negation occurrence of the attribute i...

متن کامل

A new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining

Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...

متن کامل

Identifying and Evaluating Effective Factors in Green Supplier Selection using Association Rules Analysis

Nowadays companies measure suppliers on the basis of a variety of factors and criteria that affect the supplier's selection issue. This paper intended to identify the key effective criteria for selection of green suppliers through an efficient algorithm callediterative process mining or i-PM. Green data were collected first by reviewing the previous studies to identify various environmental cri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Information Science

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2006